Approximate Convex Hull of Data Streams
نویسندگان
چکیده
Given a finite set of points P ⊆ R, we would like to find a small subset S ⊆ P such that the convex hull of S approximately contains P . More formally, every point in P is within distance from the convex hull of S. Such a subset S is called an -hull. Computing an -hull is an important problem in computational geometry, machine learning, and approximation algorithms. In many real world applications, the set P is too large to fit in memory. We consider the streaming model where the algorithm receives the points of P sequentially and strives to use a minimal amount of memory. Existing streaming algorithms for computing an -hull require O( (1−d)/2) space, which is optimal for a worst-case input. However, this ignores the structure of the data. The minimal size of an -hull of P , which we denote by OPT, can be much smaller. A natural question is whether a streaming algorithm can compute an -hull using only O(OPT) space. We begin with lower bounds that show that it is not possible to have a single-pass streaming algorithm that computes an -hull with O(OPT) space. We instead propose three relaxations of the problem for which we can compute -hulls using space near-linear to the optimal size. Our first algorithm for points in R2 that arrive in random-order uses O(logn · OPT) space. Our second algorithm for points in R2 makes O(log( 1 )) passes before outputting the -hull and requires O(OPT) space. Our third algorithm for points in R for any fixed dimension d outputs an -hull for all but δ-fraction of directions and requires O(OPT · log OPT) space. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملComputing the Approximate Convex Hull in High Dimensions
In this paper, an effective method with time complexity of O(K3/2N2 log K ǫ0 ) is introduced to find an approximation of the convex hull for N points in dimension n, where K is close to the number of vertices of the approximation. Since the time complexity is independent of dimension, this method is highly suitable for the data in high dimensions. Utilizing a greedy approach, the proposed metho...
متن کاملQuasi-Optimal Network Utility Maximization for Scalable Video Streaming
This paper addresses rate control for transmission of scalable video streams via Network Utility Maximization (NUM) formulation. Due to stringent QoS requirements of video streams and specific characterization of utility experienced by end-users, one has to solve nonconvex and even nonsmooth NUM formulation for such streams, where dual methods often prove incompetent. Convexification plays an i...
متن کاملSequential and Parallel Approximate Convex Hull Algorithms
This paper defines the area measure of the quality of approximate convex hulls and proposes two new approximate convex hull algorithms. The first one is superior to known techniques under the area measure and comparable under the distance measure and time complexity. The second algorithm is superior to all known algorithms in both area and distance measures (including the first algorithm) while...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.04564 شماره
صفحات -
تاریخ انتشار 2017